Provably good algorithms for transmission scheduling in WDM optical networksDASGUPTA, B; PALIS, M. A.Journal of parallel and distributed computing (Print). 1999, Vol 57, Num 3, pp 345-357, issn 0743-7315Article

Parallel parsing of tree adjoining grammars on the connection machinePALIS, M. A; WEI, D. S. L.International journal of parallel programming. 1992, Vol 21, Num 1, pp 1-38, issn 0885-7458Article

An efficient all-parses systolic algorithm for general context-free parsingIBARRA, O. H; PALIS, M. A.International journal of parallel programming. 1990, Vol 19, Num 4, pp 295-331, issn 0885-7458Article

On efficient simulations of systolic arrays by random-access machinesIBARRA, O. H; PALIS, M. A.SIAM journal on computing (Print). 1987, Vol 16, Num 2, pp 367-377, issn 0097-5397Article

Upper bounds on recognition of a hierarchy of non-context-free languagesPALIS, M. A; SHENDE, S. M.Theoretical computer science. 1992, Vol 98, Num 2, pp 289-319, issn 0304-3975Article

Online scheduling of dynamic treesPALIS, M. A; LIOU, J.-C; RAJASEKARAN, S et al.Parallel processing letters. 1995, Vol 5, Num 4, pp 635-646, issn 0129-6264Article

Fast parallel language recognition by cellular automataIBARRA, O. H; PALIS, M. A; KIM, S. M et al.Theoretical computer science. 1985, Vol 41, Num 2-3, pp 231-246, issn 0304-3975Article

An optimal linear-time parallel parser for tree adjoining languagesPALIS, M. A; SHENDE, S; WEI, D. S. L et al.SIAM journal on computing (Print). 1990, Vol 19, Num 1, pp 1-31, issn 0097-5397Article

On pebble automataCHANG, J. H; IBARRA, O. H; PALIS, M. A et al.Theoretical computer science. 1986, Vol 44, Num 1, pp 111-121, issn 0304-3975Article

Parallel parsing on a one-way array of finite state mechanicsCHANG, J. H; IBARRA, O. H; PALIS, M. A et al.IEEE transactions on computers. 1986, Vol 36, Num 1, pp 64-75, issn 0018-9340Article

Efficient simulations of simple models of parallel computation by time-bounded ATMs and space-bounded TMsCHANG, J. H; IBARRA, O. H; PALIS, M. A et al.Theoretical computer science. 1989, Vol 68, Num 1, pp 19-36, issn 0304-3975Article

On efficient recognition of transductions and relationsIBARRA, O. H; PALIS, M. A; CHANG, J. H et al.Theoretical computer science. 1985, Vol 39, Num 2-3, pp 89-106, issn 0304-3975Article

Online real-time preemptive scheduling of jobs with deadlinesDASGUPTA, B; PALIS, M. A.Lecture notes in computer science. 2000, pp 96-107, issn 0302-9743, isbn 3-540-67996-0Conference Paper

Task culstering and scheduling for distributed memory parallel architecturesPALIS, M. A; LIOU, J.-C; WEI, D. S. L et al.IEEE transactions on parallel and distributed systems. 1996, Vol 7, Num 1, pp 46-55, issn 1045-9219Article

Packet routing and PRAM emulation on star graphs and leveled networksPALIS, M. A; RAJASEKARAN, S; WEI, D. S. L et al.Journal of parallel and distributed computing (Print). 1994, Vol 20, Num 2, pp 145-157, issn 0743-7315Article

Designing systolic algorithms using sequential machinesIBARRA, O. H; KIM, S. M; PALIS, M. A et al.IEEE transactions on computers. 1986, Vol 35, Num 6, pp 531-542, issn 0018-9340Article